On Bottleneck Product Rate Variation Problem with Batching

نویسندگان

  • Shree Khadka Central Department of Mathematics, Tribhuvan University, Kathmandu, Nepal
  • Tanka Dhamala Central Department of Mathematics, Tribhuvan University, Kathmandu, Nepal
چکیده مقاله:

The product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. The assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. The first phase determines the size and the number of batches and the second one sequences the batches of models. In this paper, the bottleneck case i.e. the min-max case of the problem with a generalized objective function is formulated. A Pareto optimal solution is proposed and a relation between optimal sequences for the problem with different objective functions is investigated. 

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

on bottleneck product rate variation problem with batching

the product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. the assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. the first phase determ...

متن کامل

Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem

In this paper, we consider the minmax product rate variation problem (PRVP), which consists in sequencing copies of different products on an assembly line in such a way that the maximum value of a discrepancy function between actual and ideal productions is minimum. One means of solving this problem lies in its reduction to a bottleneck assignment problem with a matrix of a special structure. T...

متن کامل

A Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...

متن کامل

Note on Performance of Heuristics for Solving the Product Rate Variation Problem

Sequencing units on a production or assembly line in order to attenuate the variations in the rates of resource consumption is a problem that has received growing attention in recent years. The present study features an analysis of the PRV (Product Rate Variation) problem with quadratic discrepancy function. Taking advantage of the properties satisfied by any optimum sequence, efficiency of sev...

متن کامل

An on-line bin-batching problem

In this note we consider a new problem, the so-called bin-batching problem related to variablesized bin covering. A best possible on-line algorithm is presented. ? 2001 Elsevier Science B.V. All rights reserved.

متن کامل

A Batching Problem with Learning Effect Considerations

2 Consider a batch-sizing problem, where all jobs are identical or similar, and a unit processing time (1  p) is specified for each job. To minimize the total completion time of jobs, partitioning jobs into batches may be necessary. Learning effect from setup repetition makes small-sized batches; on the contrary, job's learning effect results in large-sized batches. With their collaborative in...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 05  شماره 2

صفحات  477- 491

تاریخ انتشار 2013-07-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023